A Linear Algorithm for the Cutting Center of a Tree
نویسندگان
چکیده
As a measure of the extent to which the removal of a node disconnects a graph, the cutting number c(v) of a node v in a connected graph G has been defined to be the number of pairs of nodes in different components of G {v}. We present a linear algorithm for determining c(v) for all nodes of a tree, and hence for identifying the cutting center, which consists of the nodes v at which c(v) is maximized.
منابع مشابه
Optimization of Cutting Parameters Based on Production Time Using Colonial Competitive (CC) and Genetic (G) Algorithms
A properly designed machining procedure can significantly affect the efficiency of the production lines. To minimize the cost of machining process as well as increasing the quality of products, cutting parameters must permit the reduction of cutting time and cost to the lowest possible levels. To achieve this, cutting parameters must be kept in the optimal range. This is a non-linear optimizati...
متن کاملOptimization of Cutting Parameters Based on Production Time Using Colonial Competitive (CC) and Genetic (G) Algorithms
A properly designed machining procedure can significantly affect the efficiency of the production lines. To minimize the cost of machining process as well as increasing the quality of products, cutting parameters must permit the reduction of cutting time and cost to the lowest possible levels. To achieve this, cutting parameters must be kept in the optimal range. This is a non-linear optimizati...
متن کاملIdentification of Geochemical Anomalies Using Fractal and LOLIMOT Neuro-Fuzzy modeling in Mial Area, Central Iran
The Urumieh-Dokhtar Magmatic Arc (UDMA) is recognized as an important porphyry, disseminated, vein-type and polymetallic mineralization arc. The aim of this study is to identify and subsequently determine geochemical anomalies for exploration of Pb, Zn and Cu mineralization in Mial district situated in UDMA. Factor analysis, Concentration-Number (C-N) fractal model and Local Linear Model Tree (...
متن کاملRestoration of the Mechanical Axis in Total Knee Artrhoplasty Using Patient-Matched Technology Cutting Blocks. A Retrospective Study of 132 Cases
Background: The aim of this study is to evaluate the accuracy of bone cuts and the resultant alignment, using theMyKnee patient specific cutting blocks.Methods: We retrospectively reviewed 132 patients undergoing primary TKR for osteoarthritis by one single surgeon.The operative time, the preoperative Hip-Knee-Ankle (HKA) axis based on the CT-scan, the postoperative HKA axisbased on long axis s...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 23 شماره
صفحات -
تاریخ انتشار 1986